#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=200;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn],sum[maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL t;cin>>t;
  while(t--){
    LL n;cin>>n;
    for(LL i=0;i<n+10;i++) a[i]=sum[i]=0;
    for(LL i=0;i<n;i++) cin>>a[i];
    LL ans=0;
    bool flag=0;
    for(LL i=0;i<n;i++){
        if(a[i]>i){
            ans+=(a[i]-i);
            a[i]=i;
        }
        else if(a[i]<i){
            LL cnt=i-a[i];
            ans-=cnt;
            if(ans<0){
                flag=1;break;
            }
        }
    }
    if(flag==1){
        cout<<"NO"<<"\n";
    }
    else cout<<"YES"<<"\n";
   }
return 0;
}
